Multiple trees

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strongly transitive multiple trees

We give an amalgamation construction of free multiple trees with a strongly transitive automorphism group. The construction shows that any partial codistance function on a tuple of finite trees can be extended to yield strongly transitive multiple trees.

متن کامل

Multiple decision trees

This paper describes experiments, on two domains, to investigate the effect of averaging over predictions of multiple decision trees, instead of using a single tree. Other authors have pointed out theoretical and commonsense reasons for preferring· the multiple tree approach. Ideally, we would like to consider predictions from all trees, weighted by their probability. However, there is a vast·n...

متن کامل

On Multiple Eigenvalues of Trees

Let T be a tree of order n > 6 with μ as a positive eigenvalue of multiplicity k. Star complements are used to show that (i) if k > n/3 then μ = 1, (ii) if μ = 1 then, without restriction on k, T has k+ 1 pendant edges that form an induced matching. The results are used to identify the trees with a non-zero eigenvalue of maximum possible multiplicity.

متن کامل

Multiple criteria minimum spanning trees

The NP multiple criteria minimum spanning tree as several applications into the network design problems. In this paper, we first introduce some properties than can help to characterize the problem, as well as to produce heuristics to solve it in a more efficient way. In the second part, we propose an application of the Multiple Objective Network optimization based on the Ant Colony Optimization...

متن کامل

Multiple Binary Trees Encryption Principle

Through block cipher method, this paper demonstrates using preorder and post traversal sequence of a binary tree with 64 nodes to implement symmetric encryption/decryption. The different traversal sequences may determine a binary tree, so the method is vulnerable to be attacked. The paper’s further deduction involves improvement using multiple binary trees, so that more secure and efficient sym...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2004

ISSN: 0021-8693

DOI: 10.1016/s0021-8693(03)00415-0